Distributed Selfish Load Balancing
نویسندگان
چکیده
منابع مشابه
Selfish Load Balancing
Suppose that a set of weighted tasks shall be assigned to a set of machines with possibly different speeds such that the load is distributed evenly among the machines. In computer science, this problem is traditionally treated as an optimization problem. One of the classical objectives is to minimize the makespan, i.e., the maximum load over all machines. Here we study a natural game theoretic ...
متن کاملGame Theory: Distributed Selfish Load Balancing on Networks
for non-mathematicians Explaining the subject of my Bachelor thesis to those who do not study either Mathematics or Computer Science isn’t an easy task, but I can give an idea of the problem studied by giving an example. Imagine, for example, that there are only two roads from Paris to Brussels: road A & road B. If you take road A you’ll always drive 5 hours, independent from the usage of road ...
متن کاملSelfish Load Balancing Under Partial Knowledge
We consider n selfish agents or players, each having a load, who want to place their loads to one of two bins. The agents have an incomplete picture of the world: They know some loads exactly and only a probability distribution for the rest. We study Nash equilibria for this model, we compute the Price of Anarchy for some cases and show that sometimes extra information adversely affects the Div...
متن کاملBalancing Load via Small Coalitions in Selfish Ring Routing Games
This paper concerns the asymmetric atomic selfish routing game for load balancing in ring networks. In the selfish routing, each player selects a path in the ring network to route one unit traffic between its source and destination nodes, aiming at a minimum maximum link load along its own path. The selfish path selections by individuals ignore the system objective of minimizing the maximum loa...
متن کاملDynamic Load Balancing for Distributed
In this paper we study diffusion schemes for dynamic load balancing on message passing multiprocessor networks. One of the main results concerns conditions under which these dynamic schemes converge and their rates of convergence for arbitrary topologies. These results use the eigenstructure of the iteration matrices that arise in dynamic load balancing. We completely analyze the hypercube netw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2007
ISSN: 0097-5397,1095-7111
DOI: 10.1137/060660345